Minimization of circuit registers: Retiming revisited
نویسندگان
چکیده
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but using a minimal number of registers? The construction of such a circuit can be done in polynomial time and is based on a result of Orlin for one periodic bi-infinite graphs showing that the cardinality maximum flow is equal to the size of a minimum cut. The idea is to view such a graph as the unfolding of the dependences in a digital circuit.
منابع مشابه
Retiming and resynthesis: optimizing sequential networks with combinational techniques
Sequential networks contain combinational logic blocks separated by registers. Application of combinational logic minimization techniques to the separate logic blocks results in improvement that is restricted by the placement of the registers; information about logical dependencies between blocks separated by registers is not utilized. Temporarily moving all the registers to the periphery of a ...
متن کاملExperiments in the Iterative Application of Resynthesis and Retiming
Many attempts have been made to combine some form of retiming with combina tional optimization techniques to improve the performance of sequential circuits To achieve improvements registers are shifted to expose di erent and sometimes larger combinational blocks for resynthesis A simple yet unexplored sequential optimiza tion consists of iteratively applying retiming and resynthesis Retiming ch...
متن کاملMin-Area Retiming on Dynamic Circuit Structures
In this paper we present two techniques for improving min-area retiming that combine the actual register minimization with combinational optimization. First, we discuss an on-the-fly retiming approach based on a sequential AND/INVERTER/REGISTER graph. With this method the circuit structure is sequentially compacted using a combination of register “dragging” and AND vertex hashing. Second, we pr...
متن کاملOptimal Retiming for Initial State Computation
Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state for the retimed circuit. In this paper we propose a new efficient retiming algorithm for performance optimization. The retiming determined by the algorithm is the best with respect to initial state computation. It is th...
متن کاملEecient Implementation of Retiming
Narendra Shenoy Richard Rudell Synopsys Inc., 700 E. Middle eld Road, Mountain View CA 94043 Abstract Retiming is a technique for optimizing sequential circuits. It repositions the registers in a circuit leaving the combinational cells untouched. The objective of retiming is to nd a circuit with the minimum number of registers for a speci ed clock period. More than ten years have elapsed since ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 156 شماره
صفحات -
تاریخ انتشار 2008